cutting plane algorithm meaning in English

割平面法

A strength relaxation of semidefinite programming for standard quadratic optimization problems is given . the relaxation is transformed to a semi - indefinite programming . a linear programming cutting plane algorithm is proposed
3 .给出标准二次优化问题的一个强化半定规划松弛模型,把该模型转化为半不定的线性规划问题,并提出线性规划的一种新的割平面算法解该问题,理论和数值实验证明了算法的有效性
This paper consists of three parts as follows , 1 . a nonsmooth convex programming is relaxed to a smooth convex programming by using a cutting - plane , which is constructed by subgradient . an algorithm based on the cutting - plane is presented . in this way , a cutting plane algorithm and it ' s convergence for semide ? nite programming are provided
利用次微分的概念给出了一种非光滑凸规划割平面的构造技巧，找到了半定规划可行域的一个支撑超平面，从而给出了求解半定规划的一种割平面算法